Independence Saturation and Extended Domination Chain in Graphs
نویسندگان
چکیده
The six basic parameters relating to domination, independence and irredundance satisfy a chain of inequalities given by ir ≤ γ ≤ i ≤ β0 ≤ Γ ≤ IR where ir, IR are the irredundance and upper irredundance numbers, γ,Γ are the domination and upper domination numbers and i, β0 are the independent domination number and independence number respectively. In this paper, we introduce the concept of independence saturation number IS of a graph which extends the above domination chain. We also consider the edge-analogue of this extended domination chain.
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملBipartite theory of Semigraphs
Given a semigraph, we can construct graphs Sa, Sca, Se and S1e. In the same pattern, we construct bipartite graphs CA(S), A(S), VE(S), CA(S) and A(S). We find the equality of domination parameters in the bipartite graphs constructed with the domination and total domination parameters of the graphs Sa and Sca. We introduce the domination and independence parameters for the bipartite semigraph. W...
متن کاملParameters of independence and domination by monochromatic paths in graphs
In this paper we generalize parameters of independence and domination for graphs. The behavior of parameters for independence and domination by monochromatic paths is studied when an edge or a vertex is deleted. Then we give main results concerning μ-feasible sequences and interpolation.
متن کاملOn the saturation number of graphs
Let $G=(V,E)$ be a simple connected graph. A matching $M$ in a graph $G$ is a collection of edges of $G$ such that no two edges from $M$ share a vertex. A matching $M$ is maximal if it cannot be extended to a larger matching in $G$. The cardinality of any smallest maximal matching in $G$ is the saturation number of $G$ and is denoted by $s(G)$. In this paper we study the saturation numbe...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کامل